منابع مشابه
Assigning Experimental and Testing Numbers Considered Useful
When experimenting with or extending protocols, it is often necessary to use some sort of protocol number or constant in order to actually test or experiment with the new function, even when testing in a closed environment. For example, to test a new DHCP option, one needs an option number to identify the new function. This document recommends that when writing IANA Considerations sections, aut...
متن کاملPrime Numbers Considered Useful: Ontology Encoding for Efficient Subsumption Testing
Multiple inheritance hierarchies are frequently used for the classification of concepts into a taxonomy, to model software by organizing classes into an inheritance hierarchy, for querying object-oriented databases, for knowledge representation, policy enforcement, and subtyping of service interfaces for safe composition and substitution. All these areas apply hierarchies and share the same con...
متن کاملNon-Deterministic Parallelism Considered Useful
The development of distributed execution engines has greatly simplified parallel programming, by shielding developers from the gory details of programming in a distributed system, and allowing them to focus on writing sequential code [8, 11, 18]. The “sacred cow” in these systems is transparent fault tolerance, which is achieved by dividing the computation into atomic tasks that execute determi...
متن کاملCorrupted Speech Data Considered Useful
The success of Voice-over-IP technology will crucially depend on the provision of a certain level of perceptual speech quality. In this paper we demonstrate that keeping as much corrupted speech data as possible results in a major step towards this goal. To this end, we explore the combination of two key factors which influence the speech quality as perceived by the user: networking mechanisms ...
متن کاملLLC Dead Block Prediction Considered Not Useful
Dead block predictors (DBPs) improve cache efficiency by identifying blocks that have exhausted their useful lifetime in the cache and prioritizing them for eviction regardless of how much reuse these blocks have experienced. In doing so, DBPs go beyond insertion policies that target only those blocks that have no cache reuse. But how much value do DBPs add over insertion policies? This work ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing in Science & Engineering
سال: 2006
ISSN: 1521-9615
DOI: 10.1109/mcse.2006.124